A two-level search algorithm for motion planning
نویسنده
چکیده
A two-level search algorithm for motion planning is presented in this paper. The algorithm combines a multiheuristic local search algorithm with a subgoal graph based global guidance. A novel feature of the planner is that it can adjust the balance between local and global planning. As the experimental data suggests that the optimal balance depends on the problem, a scheduling mechanism is added to the algorithm to adjust the balance during planning. The resulting motion planner is capable of solving very difficult motion planning problems.
منابع مشابه
Adaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملNear-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملMotion planning through policy search
We propose a motion planning algorithm for performing policy search in the full pose and velocity space of a mobile robot. By comparison, existing techniques optimize high-level plans, but fail to optimize the low-level motion controls. We use policy search in a high dimensional control space to find plans that lead to measurably better motion planning. Our experimental results suggest that our...
متن کاملHierarchical Motion Planning with Kinodynamic Feasibility Guarantees
Motion planning for mobile vehicles involves the solution of two disparate sub-problems: the satisfaction of highlevel logical task specifications and the design of low-level vehicle control laws. A hierarchical solution of these two sub-problems is efficient, but may not ensure compatibility between the highlevel planner and the dynamic constraints of the vehicle. To guarantee such compatibili...
متن کاملPath Planning of a 3 DOF Servo-Hydraulic Mechanism Using Genetic Algorithm
The objective of this paper is path planning of a 3 DOF planer robot with hydraulic actuator using genetic algorithm. First the geometric and kinematic parameters of robot were established. The equations of motion are derived by Lagrange method. We proposed the model for proportional valve and hydraulic actuators. Then using the genetic algorithm we minimized the hydraulic energy consumption as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997